On the spectral moment of graphs with k cut edges
نویسندگان
چکیده
منابع مشابه
On the spectral moment of graphs with k cut edges
Let A(G) be the adjacency matrix of a graph G with λ1(G), λ2(G), . . . , λn(G) its eigenvalues in non-increasing order. Call the number Sk(G) := ∑ n i=1 λ i (G) (k = 0, 1, . . . , n − 1) the kth spectral moment of G. Let S(G) = (S0(G), S1(G), . . . , Sn−1(G)) be the sequence of spectral moments of G. For two graphsG1 and G2, we have G1 ≺s G2 if Si(G1) = Si(G2) for i = 0, 1, . . . , k−1 and Sk(G...
متن کاملEla on the Spectral Moment of Graphs with K Cut Edges
Let A(G) be the adjacency matrix of a graph G with λ1(G), λ2(G), . . . , λn(G) its eigenvalues in non-increasing order. Call the number Sk(G) := ∑ n i=1 λ i (G) (k = 0, 1, . . . , n − 1) the kth spectral moment of G. Let S(G) = (S0(G), S1(G), . . . , Sn−1(G)) be the sequence of spectral moments of G. For two graphsG1 and G2, we have G1 ≺s G2 if Si(G1) = Si(G2) for i = 0, 1, . . . , k−1 and Sk(G...
متن کاملOn the spectral radius of graphs with cut edges
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Kk n , where K k n is a graph obtained by joining k independent vertices to one vertex of Kn−k . We also discuss the limit point of the maximal spectral radius. © 2004 Elsevier Inc. Al...
متن کاملOn the variable sum exdeg index and cut edges of graphs
The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number, du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.
متن کاملThe Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
LetB(n, r) be the set of all bicyclic graphs with n vertices and r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in B(n, r).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2013
ISSN: 1081-3810
DOI: 10.13001/1081-3810.1682